Complete theory - PDFSEARCH.IO - Document Search Engine

Complete theory
Results: 1780

#	Item
531	CCCG 2010, Winnipeg MB, August 9–11, 2010 Approximating the Independent Domatic Partition Problem in Random Geometric Graphs – An Experimental Study Dhia Mahjoub Add to Reading List Source URL: cccg.ca Language: English - Date: 2010-07-19 10:46:18 NP-complete problems Graph coloring Domatic number Dominating set Independent set Greedy coloring Topology Maximal independent set Graph Graph theory Theoretical computer science Mathematics
532	Journal of Machine Learning Research vol–23 Submitted 24 May 2012; Published 2012 Spectral Clustering of Graphs with General Degrees in the Extended Planted Partition Model Add to Reading List Source URL: cseweb.ucsd.edu Language: English - Date: 2012-06-05 15:17:28 Algebraic graph theory NP-complete problems Graph partition Laplacian matrix Degree Random graph Laplace operator Adjacency matrix Tutte polynomial Mathematics Graph theory Mathematical analysis
533	the complete title of one (or more) paper(s) published in the open literature describing the work that the author claims describes a human-competitive result, The Network Operator Method for Synthesis of Intelligent Con Add to Reading List Source URL: www.genetic-programming.org Language: English - Date: 2013-06-23 23:01:08 Cybernetics Optimal control Computer Function Mathematics Mathematical optimization Control theory
534	CCCG 2011, Toronto ON, August 10–12, 2011 Approximating the Obstacle Number for a Graph Drawing Efficiently∗ Deniz Sarı¨oz† Abstract Add to Reading List Source URL: 2011.cccg.ca Language: English - Date: 2011-08-06 04:11:12 Hypergraph Combinatorics Vertex cover Graph Incidence matrix Planar graph Path decomposition Line graph Graph theory Mathematics NP-complete problems
535	CCCG 2011, Toronto ON, August 10–12, 2011 Euclidean Movement Minimization Nima Anari∗ MohammadAmin Fazli† Add to Reading List Source URL: www.cccg.ca Language: English - Date: 2011-08-06 04:11:16 NP-complete problems Hamiltonian path Vertex cover Independent set Matching Minimum spanning tree Dominating set Graph coloring Theoretical computer science Graph theory Mathematics
536	Complete list of publications Pierre Ganty December 15, 2012 Conference Publications [1] Pierre Ganty, Radu Iosif, and Filip Koneˇcn´ y. Underapproximation of procedure summaries for integer programs. In TACAS ’13: P Add to Reading List Source URL: software.imdea.org Language: English - Date: 2012-12-15 15:15:15 Models of computation Model checking Petri net Lecture Notes in Computer Science ALGOL 68 Computer Aided Verification Formal methods Software engineering Computing Programming language theory
537	Complete Fairness in Secure Two-Party Computation∗ S. Dov Gordon Carmit Hazay Jonathan Katz Add to Reading List Source URL: www.wisdom.weizmann.ac.il Language: English - Date: 2008-07-05 10:54:06 Cryptography Quantum complexity theory PP Secure multi-party computation Secure two-party computation Verifiable secret sharing Function Transmission Control Protocol Cryptographic protocols Mathematics Applied mathematics
538	Logic and Lattices for Distributed Programming Neil Conway William Marczak Peter Alvaro Joseph M. Hellerstein Add to Reading List Source URL: db.cs.berkeley.edu Language: English - Date: 2012-06-22 16:27:05 Lattice theory Algebra Order theory Lattice Semilattice Class Boolean algebra Monotonic function Complete Heyting algebra Abstract algebra Mathematics Algebraic structures
539	WO RKSHO P O N PARAM ETERI ZED CO M PLEXI TY All lectures will take place in Engineering Quad, Building EF, Seminar Room EF122 http://www.fpt.wikidot.com Tuesday, 3 0 M archMorning Session. Chair: Frances Rosamo Add to Reading List Source URL: fpt.wdfiles.com Language: English - Date: 2012-09-17 04:50:14 Computational complexity theory Michael Fellows Parameterized complexity NP-complete problems Vertex cover Bioinformatics Theoretical computer science Applied mathematics Mathematics
540	PCCR 2014 Report Serge Gaspers, UNSW Australia and NICTA PCCR 2014, the 2nd Workshop on the Parameterized Complexity of Computational Reasoning, took place in Vienna, Austria, 17-18 July 2014, as part of FLoC and the Vie Add to Reading List Source URL: fpt.wdfiles.com Language: English - Date: 2014-09-25 08:44:45 Computational complexity theory Parameterized complexity FO Connectivity SL NP-complete problems Theoretical computer science Applied mathematics Complexity classes

UPDATE